A Generalized Interval Caching Policy for Mixed Interactive and Long Video Workloads

نویسندگان

  • Asit Dan
  • Dinkar Sitaram
چکیده

In a video server environment, some video objects (e.g., movies) are very large and are read sequentially. Hence it is not economical to cache the entire object. However, caching random fractions of a multimedia object is not beneecial. Therefore, traditional cache management policies such as LRU are not eeective. The sequential access of pages can be exploited by caching only the intervals between two successive streams on the same object, i.e., by retaining the pages brought in by a stream for reuse by a closely following stream and subsequently discarding them. In contrast to the movie-on-demand workload, an interactive workload is composed of many short video clips (e.g., shopping). Hence, concurrent access to the same video clip will be infrequent and interval caching policy will not be eeective. In this paper, we propose a Generalized Interval Caching policy that caches both short video objects as well as intervals or fractions of large video objects. To study the eecacy of the GIC policy, we also propose a model for mixed short interactive and long video workloads. The proposed policy is shown to effectively reduce disk overload and hence to increase the capacity of the video server.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

Analyzing Cache Performance for Video Servers

Video-on-demand (VOD) is expected to become one of the most important and successful services to be offered on emerging technologies. There is not just an interest in the delivery of digital video for home entertainment purposes, but there are also several educational and commercial benefits from this service. However, for this service to become viable, it is important that the video servers me...

متن کامل

Bu er Management Policy for an On - Demand

In an on-demand video server environment, multimedia objects (e.g. movies) are very large and are read sequentially. Hence it is not economical to cache the entire object. However, caching random fractions of a multimedia object is not beneecial. This is due to the stringent response time requirements where continuous availability of a stream has to be guaranteed; whereas caching random fractio...

متن کامل

Aggregates Caching in Columnar In-Memory Databases

The mixed database workloads found in enterprise applications are comprised of short-running transactional as well as analytical queries with resource-intensive data aggregations. In this context, caching the query results of long-running queries is desirable as it increases the overall performance. However, traditional caching approaches are inefficient in a way that changes in the base data r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996